\relax 
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{Statement of Originality}{v}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{Acknowledgments}{vii}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{Abstract}{ix}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{loa}{\addvspace {10\p@ }}
\citation{Letunic.01012007}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{List of Figures}{xiii}}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{List of Tables}{xv}}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{List of Algorithms}{xvii}}
\citation{Cheng.}
\citation{Garofalakis.2005}
\citation{Green.2004}
\citation{Tai.1979}
\citation{Zhang.1989}
\citation{Kilpelainen.1995}
\citation{Hoffmann.1982}
\citation{Ramesh.1992}
\citation{Aho.2007}
\citation{Appel.2002}
\citation{Grune.2000}
\citation{Hutchison.2013}
\citation{Zhang.1989}
\citation{Jiang.1994}
\citation{Gusfield.1997}
\citation{Ukkonen.1985}
\citation{Wagner.1974}
\citation{PhilipBille.2005}
\citation{Tai.1979}
\citation{Wagner.1974}
\citation{Zhang.1989}
\citation{Jiang.1994}
\citation{PhilipBille.2005}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {1}Introduction}{1}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {1.1}Tree Comparison}{1}}
\@writefile{toc}{\contentsline {section}{\numberline {1.2}Tree Distance Metric}{1}}
\citation{PhilipBille.2005}
\citation{Arora.1998}
\citation{Valiente.2003}
\citation{Zhang.1996}
\citation{Cormen.op.2009}
\citation{Chen.2001}
\citation{Letunic.01012007}
\citation{Letunic.01012007}
\@writefile{toc}{\contentsline {section}{\numberline {1.3}The Problem}{2}}
\@writefile{lof}{\contentsline {figure}{\numberline {1.1}{\ignorespaces Phylogenetic tree produced by tree edit distance comparison of genomes.\cite  {Letunic.01012007}}}{3}}
\newlabel{sample}{{1.1}{3}}
\@writefile{toc}{\contentsline {section}{\numberline {1.4}Organisation}{3}}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {2}Operations}{5}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {2.1}Relabel}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces Illistrates the relabel of B to G.}}{5}}
\newlabel{Relabel}{{2.1}{5}}
\@writefile{toc}{\contentsline {section}{\numberline {2.2}Delete}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces Illistrates the deletion of node K.}}{6}}
\newlabel{Delete}{{2.2}{6}}
\@writefile{toc}{\contentsline {section}{\numberline {2.3}Insert}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces Illistrates the insertion of node H.}}{6}}
\newlabel{Insert}{{2.3}{6}}
\@writefile{toc}{\contentsline {section}{\numberline {2.4}Rotation}{7}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.4}{\ignorespaces This illustrates Left Rotation.}}{7}}
\newlabel{leftRotation}{{2.4}{7}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.5}{\ignorespaces This illustrates Right Rotation}}{7}}
\newlabel{rightRotation}{{2.5}{7}}
\@writefile{toc}{\contentsline {section}{\numberline {2.5}Switch}{7}}
\@writefile{lof}{\contentsline {figure}{\numberline {2.6}{\ignorespaces This illustrates switching}}{8}}
\newlabel{switch}{{2.6}{8}}
\@writefile{loa}{\addvspace {10\p@ }}
\citation{Shasha.1990}
\citation{Zhang.1996}
\citation{Lu.2001}
\citation{Zhang.1996}
\citation{Widmayer.1999}
\citation{Valiente.2003}
\@writefile{toc}{\contentsline {chapter}{\numberline {3}Algorithms}{9}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {3.1}Tree Edit Distance}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1.1}Tai Algorithm}{9}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.1}{\ignorespaces The first tree is the original tree which needs to be changed. The second tree is the original tree after K has been removed. The last tree is the tree after K has been inserted and C has been relabeled to E.}}{10}}
\newlabel{}{{3.1}{10}}
\@writefile{loa}{\contentsline {algocf}{\numberline {1}{\ignorespaces Tai Tree Edit Distance}}{11}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1.2}Zhang \& Shashas' Algorithm}{11}}
\@writefile{loa}{\contentsline {algocf}{\numberline {2}{\ignorespaces Keyroots for Zhang and Shashas' algorithm}}{12}}
\@writefile{toc}{\contentsline {section}{\numberline {3.2}Tree Alignment Distance}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {3.2}{\ignorespaces Illistrates how tree alignment works.}}{12}}
\@writefile{loa}{\contentsline {algocf}{\numberline {3}{\ignorespaces ComputeForest: This is the main algorithm which determines the distance once a tree alignment has been found.}}{13}}
\@writefile{toc}{\contentsline {section}{\numberline {3.3}Tree Rotation Distance}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3.1}Rotation Distance}{13}}
\@writefile{loa}{\contentsline {algocf}{\numberline {4}{\ignorespaces ComputeTree}}{14}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.3.2}Tree Rotation Distance}{14}}
\@writefile{loa}{\contentsline {algocf}{\numberline {5}{\ignorespaces Attributes of a Node}}{14}}
\@writefile{loa}{\contentsline {algocf}{\numberline {6}{\ignorespaces Determines the distance between the two Trees.}}{15}}
\@writefile{loa}{\contentsline {algocf}{\numberline {7}{\ignorespaces Tree Switch}}{16}}
\@writefile{loa}{\contentsline {algocf}{\numberline {8}{\ignorespaces Determine depth of node}}{16}}
\@writefile{loa}{\contentsline {algocf}{\numberline {9}{\ignorespaces Determine if switch required}}{17}}
\@writefile{loa}{\contentsline {algocf}{\numberline {10}{\ignorespaces Switch on you have two nodes at the same level which need to be switched.}}{17}}
\@writefile{loa}{\contentsline {algocf}{\numberline {11}{\ignorespaces Switch in the case of Empty on same level.}}{18}}
\@writefile{loa}{\contentsline {algocf}{\numberline {12}{\ignorespaces Provides switches to other levels in the tree.}}{18}}
\@writefile{loa}{\contentsline {algocf}{\numberline {13}{\ignorespaces Tree Rotation}}{18}}
\@writefile{loa}{\contentsline {algocf}{\numberline {14}{\ignorespaces Determine Rotation Distance}}{19}}
\@writefile{loa}{\contentsline {algocf}{\numberline {15}{\ignorespaces Relabel Node}}{19}}
\@writefile{loa}{\contentsline {algocf}{\numberline {16}{\ignorespaces Insert Node}}{20}}
\@writefile{loa}{\contentsline {algocf}{\numberline {17}{\ignorespaces Delete Node}}{20}}
\@writefile{loa}{\contentsline {algocf}{\numberline {21}{\ignorespaces Wrapper for determining distance.}}{20}}
\@writefile{loa}{\contentsline {algocf}{\numberline {18}{\ignorespaces Identify Empty Nodes}}{21}}
\@writefile{loa}{\contentsline {algocf}{\numberline {19}{\ignorespaces Split: Determine nodes in the front and back of a tree from a node.}}{21}}
\@writefile{loa}{\contentsline {algocf}{\numberline {22}{\ignorespaces Depth: Find the node with the lowest depth.}}{21}}
\@writefile{loa}{\contentsline {algocf}{\numberline {20}{\ignorespaces Determine tree node pairs}}{22}}
\citation{Gupta.1998}
\citation{Augsten.}
\citation{Alabbas.2012}
\citation{Cleary.2002}
\citation{Zerling.1985}
\citation{Gavrila.}
\citation{YanhongZhai.2006}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {4}Proposed Approach}{23}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {4.1}Model}{23}}
\citation{Bouchachia.}
\citation{Wang.2012}
\citation{Chawathe.1997}
\citation{Chawathe.1996}
\@writefile{toc}{\contentsline {section}{\numberline {4.2}Algorithm}{24}}
\citation{Cleary.2002}
\citation{Dehornoy.2010}
\citation{Amir.2001}
\citation{Dubiner.1994}
\citation{Hoffmann.1982}
\citation{Ramesh.1992}
\citation{Wu.2010}
\citation{Ukkonen.1985}
\@writefile{toc}{\contentsline {section}{\numberline {4.3}Rotation Distance}{25}}
\@writefile{toc}{\contentsline {section}{\numberline {4.4}Error}{25}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4.1}Mean Absolute Error}{25}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4.2}Mean Square Error}{26}}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {5}Experiments and Results}{27}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {5.1}Experiment 1 Determine Best Cost Function}{27}}
\@writefile{lot}{\contentsline {table}{\numberline {5.1}{\ignorespaces \sl  Cost Function Cases Tree Edit Distance}}{27}}
\newlabel{costEdit}{{5.1}{27}}
\@writefile{lot}{\contentsline {table}{\numberline {5.2}{\ignorespaces \sl  Cost Function Cases Tree Alignment Distance}}{28}}
\newlabel{costAlign}{{5.2}{28}}
\@writefile{lot}{\contentsline {table}{\numberline {5.3}{\ignorespaces \sl  Cost Function Cases Tree Rotation Distance}}{28}}
\newlabel{costRot}{{5.3}{28}}
\@writefile{toc}{\contentsline {section}{\numberline {5.2}Experiment 2 Randomly Generated Ordered Trees}{29}}
\@writefile{lot}{\contentsline {table}{\numberline {5.4}{\ignorespaces \sl  Results for Randomly Generated Ordered Trees}}{29}}
\newlabel{unorderedResults}{{5.4}{29}}
\@writefile{toc}{\contentsline {section}{\numberline {5.3}Experiment 3 Randomly Generated Unorder Trees}{30}}
\@writefile{lot}{\contentsline {table}{\numberline {5.5}{\ignorespaces \sl  Results for Randomly Generated Unordered Trees}}{30}}
\newlabel{unorderedResults}{{5.5}{30}}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {6}Conclusions}{31}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{loa}{\addvspace {10\p@ }}
\citation{Alonso.1993}
\citation{Kilpelainen.1995}
\citation{Valiente.2003}
\bibstyle{plain}
\bibdata{Thesis}
\@writefile{toc}{\contentsline {chapter}{\numberline {7}Future Work}{32}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{Bibliography}{32}}
\@writefile{loa}{\addvspace {10\p@ }}
\bibcite{Aho.2007}{1}
\bibcite{Alabbas.2012}{2}
\bibcite{Alonso.1993}{3}
\bibcite{Amir.2001}{4}
\bibcite{Appel.2002}{5}
\bibcite{Arora.1998}{6}
\bibcite{Augsten.}{7}
\bibcite{Bouchachia.}{8}
\bibcite{Chawathe.1997}{9}
\bibcite{Chawathe.1996}{10}
\bibcite{Chen.2001}{11}
\bibcite{Cheng.}{12}
\bibcite{Cleary.2002}{13}
\bibcite{Cormen.op.2009}{14}
\bibcite{Dehornoy.2010}{15}
\bibcite{Dubiner.1994}{16}
\bibcite{Garofalakis.2005}{17}
\bibcite{Gavrila.}{18}
\bibcite{Green.2004}{19}
\bibcite{Grune.2000}{20}
\bibcite{Gupta.1998}{21}
\bibcite{Gusfield.1997}{22}
\bibcite{Hoffmann.1982}{23}
\bibcite{Hutchison.2013}{24}
\bibcite{Jiang.1994}{25}
\bibcite{Kilpelainen.1995}{26}
\bibcite{Letunic.01012007}{27}
\bibcite{Lu.2001}{28}
\bibcite{PhilipBille.2005}{29}
\bibcite{Ramesh.1992}{30}
\bibcite{Shasha.1990}{31}
\bibcite{Tai.1979}{32}
\bibcite{Ukkonen.1985}{33}
\bibcite{Valiente.2003}{34}
\bibcite{Wagner.1974}{35}
\bibcite{Wang.2012}{36}
\bibcite{Widmayer.1999}{37}
\bibcite{Wu.2010}{38}
\bibcite{YanhongZhai.2006}{39}
\bibcite{Zerling.1985}{40}
\bibcite{Zhang.1996}{41}
\bibcite{Zhang.1989}{42}
\@writefile{toc}{\contentsline {part}{Appendices}{37}}
\@writefile{loa}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {chapter}{\numberline {A}Program listings}{38}}
\@writefile{lof}{\addvspace {10\p@ }}
\@writefile{lot}{\addvspace {10\p@ }}
\@writefile{toc}{\contentsline {section}{\numberline {A.1}Node}{38}}
\@writefile{lol}{\contentsline {lstlisting}{../node.py}{38}}
\@writefile{toc}{\contentsline {section}{\numberline {A.2}Tree}{41}}
\@writefile{lol}{\contentsline {lstlisting}{../tree.py}{41}}
\@writefile{toc}{\contentsline {section}{\numberline {A.3}TED Tree}{42}}
\@writefile{lol}{\contentsline {lstlisting}{../tedtree.py}{42}}
\@writefile{toc}{\contentsline {section}{\numberline {A.4}Model}{46}}
\@writefile{lol}{\contentsline {lstlisting}{../model.py}{46}}
\@writefile{toc}{\contentsline {section}{\numberline {A.5}Generate Tree}{49}}
\@writefile{lol}{\contentsline {lstlisting}{../generatetree.py}{49}}
\@writefile{toc}{\contentsline {section}{\numberline {A.6}Rotation Distance Ordered}{55}}
\@writefile{lol}{\contentsline {lstlisting}{../rotdistordered.py}{55}}
\@writefile{toc}{\contentsline {section}{\numberline {A.7}Rotation Distance Unordered}{59}}
\@writefile{lol}{\contentsline {lstlisting}{../rotdistunordered.py}{59}}
\@writefile{toc}{\contentsline {section}{\numberline {A.8}JSON Parser}{63}}
\@writefile{lol}{\contentsline {lstlisting}{../JsonParse.py}{63}}
\@writefile{toc}{\contentsline {section}{\numberline {A.9}Program}{68}}
\@writefile{lol}{\contentsline {lstlisting}{../program.py}{68}}
\@writefile{toc}{\contentsline {section}{\numberline {A.10}Classifier}{70}}
\@writefile{lol}{\contentsline {lstlisting}{../classifier.py}{70}}
\@writefile{toc}{\contentsline {section}{\numberline {A.11}Display Tree}{70}}
\@writefile{lol}{\contentsline {lstlisting}{../displaytree.py}{70}}
\@writefile{toc}{\contentsline {section}{\numberline {A.12}Run Process}{71}}
\@writefile{lol}{\contentsline {lstlisting}{../runprocess.py}{71}}
